Solving NP-complete problems in the tile assembly model

Solving NP-complete problems in the tile assembly model

Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules or a large computer network such as the Internet. Previously, I defined deterministic and nondeterministic computation in the tile assembly model and showed how to add, multiply and factor. Here, I extend the notion of...

1 Non - Newtonian AI for solving NP - complete problems

A new kind of dynamics for simulations based upon quantum-classical hybrid is discussed. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen potentials. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measu...

Solving NP-Complete Problems With Networks of Evolutionary Processors

We propose a computational device based on evolutionary rules and communication within a network, similar to that introduced in [4], called network of evolutionary processors. An NP-complete problem is solved by networks of evolutionary processors of linear size in linear time. Some furher directions of research are finally discussed. ∗Research supported by the Dirección General de Enseñanza Su...

Solving Numerical NP-Complete Problems with Spiking Neural P Systems

neural nets: Tissue P systems. In Proceedings of COCOON 2002, Singapore, LNCS 2387, Springer-Verlag, Berlin, 290–299. 15. M. Oswald. Independent agents in a globalized world modelled by tissue P systems. Conf. Artificial Life and Robotics, 2006. 16. Gh. Păun. Computing with Membranes. Journal of Computer and System Sciences, 61:108–143, 2000. See also Turku Centre for Computer Science — TUCS Re...

Experiments on Optimally Solving NP-complete Problems on Planar Graphs